ar X iv : 0 90 4 . 31 16 v 1 [ cs . C C ] 2 0 A pr 2 00 9 Variations on Muchnik ’ s Conditional Complexity Theorem ⋆
نویسندگان
چکیده
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length and is simple conditional on b. In this paper we present two new proofs of this theorem. The first one is based on the on-line matching algorithm for bipartite graphs. The second one, based on extractors, can be generalized to prove a version of Muchnik’s theorem for space-bounded Kolmogorov complexity.
منابع مشابه
ar X iv : 0 90 4 . 23 13 v 1 [ m at h . FA ] 1 5 A pr 2 00 9 A DISCRETIZED APPROACH TO W . T . GOWERS ’ GAME
We give an alternative proof of W.T. Gowers' theorem on block bases in Banach spaces by reducing it to a discrete analogue on specific count-able nets.
متن کاملar X iv : 0 90 4 . 36 08 v 1 [ m at h . C A ] 2 3 A pr 2 00 9 THREE RESULTS IN DUNKL ANALYSIS
In this article, we establish first a geometric Paley–Wiener theorem for the Dunkl transform in the crystallographic case. Next we obtain an optimal bound for the L p → L norm of Dunkl translations in dimension 1. Finally we describe more precisely the support of the distribution associated to Dunkl translations in higher dimension.
متن کاملar X iv : 0 90 4 . 31 78 v 1 [ m at h . FA ] 2 1 A pr 2 00 9 TREE METRICS AND THEIR LIPSCHITZ - FREE SPACES
We compute the Lipschitz-free spaces of subsets of the real line and characterize subsets of metric trees by the fact that their Lipschitz-free space is isometric to a subspace of L1.
متن کاملar X iv : 0 70 9 . 04 00 v 1 [ m at h . O C ] 4 S ep 2 00 7 Noether ’ s Theorem on Time Scales ∗
We show that for any variational symmetry of the problem of the calculus of variations on time scales there exists a conserved quantity along the respective Euler-Lagrange extremals. Mathematics Subject Classification 2000: 49K05, 39A12.
متن کاملar X iv : 0 90 4 . 39 53 v 1 [ cs . A I ] 2 5 A pr 2 00 9 Guarded resolution for Answer Set Programming
We investigate a proof system based on a guarded resolution rule and show its adequacy for stable semantics of normal logic programs. As a consequence, we show that Gelfond-Lifschitz operator can be viewed as a proof-theoretic concept. As an application, we find a propositional theory EP whose models are precisely stable models of programs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009